0333 - 3590 Clustering with partial information

نویسندگان

  • Hans L. Bodlaender
  • Michael R. Fellows
  • Pinar Heggernes
  • Federico Mancini
  • Charis Papadopoulos
  • Frances Rosamond
چکیده

The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of vertex-disjoint cliques, such that the editing cost is minimized. The Edge Clique Partitioning problem seeks to partition the edges of a given graph into edge-disjoint cliques, such that the number of cliques is minimized. Both problems are known to be NP-hard, and they have been previously studied with respect to approximation and fixed parameter tractability. In this paper we study these two problems in a more general setting that we term fuzzy graphs, where the input graphs may have missing information, meaning that whether or not there is an edge between some pairs of vertices of the input graph can be undecided. For fuzzy graphs the Correlation Clustering and Edge Clique Partitioning problems have previously been studied only with respect to approximation. Here we give parameterized algorithms based on kernelization for both problems. We prove that the Correlation Clustering problem is fixed-parameter tractable on fuzzy graphs when parameterized by (k, r), where k is the editing cost and r is the minimum number of vertices required to cover the undecided edges. In particular we show that it has a polynomial-time reduction to a problem kernel on O(k + r) vertices. We provide an analogous result for the Edge Clique Partitioning problem on fuzzy graphs. Using (k, r) as parameters, where k bounds the size of the partition, and r is the minimum number of vertices required to cover the undecided edges, we describe a polynomial-time kernelization to a problem kernel on O(k ·3) vertices. This implies fixed-parameter tractability for this parameterization. Furthermore we also show that parameterizing only by the number of cliques k, is not enough to obtain fixed-parameter tractability. The problem remains, in fact, NP-hard for each fixed k > 2.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

0333 - 3590 Personal Information Leakage : A Study of Online Systems in Norway

Governments and commercial companies connect more and more computer systems to the Internet, giving people easier access to services. Many of these online services handle personal information. Leakage of such information can facilitate largescale identity theft. This report determines how personal information leaks from online systems of national importance, discusses proof of concept software ...

متن کامل

ISSN 0333-3590 Iterative decoding for the asymmetric channel

We discuss several aspects of coding for the asymmetric channel, with emphasis on iterative coding. We implement turboand LDPC decoders for the Z-channel, and a novel coding scheme designed to approach the optimum input distribution for the channel. Index terms Z-channel, iterative decoding, channel capacity.

متن کامل

REPORTS IN INFORMATICS ISSN 0333-3590 A Construction for Binary Sequence Sets with Low Peak-to-Average Power Ratio

A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) with respect to any Local Unitary Unimodular Transform (including all one and multi-dimensional Discrete Fourier Transforms).

متن کامل

ISSN 0333-3590 Pathwidth of cubic graphs and exact algorithms

We prove that for any ε > 0 there exists an integer nε such that the pathwidth of every cubic graph on n > nε vertices is at most (1/6 + ε)n. Based on this bound we improve the worst case time analysis for a number of exact exponential algorithms on graphs of maximum vertex degree three.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008